Reducing content addressable memory (cam) power consumption counters

ABSTRACT

A method may include counting the number of times each of a plurality of entries in a content addressable memory (CAM) matches one or more searches; grouping entries in the CAM into a first subset and a second subset based on the number of times each of the plurality of entries in the CAM matches one or more searches; and searching the first subset for a matching entry and, if no matching entry is found, searching the second subset for the matching entry.

BACKGROUND

A content addressable memory (CAM) may be designed so that it searches its entire memory to see if the supplied data is stored anywhere in it. If the data is found, the CAM may return the memory address where the data was found. Applications requiring high-speed searching may employ CAMs to store the data to be searched. For example, a firewall application may search a CAM to determine if a data packet (identified by source address, destination address, source port, and/or destination port, for example) should be forwarded or dropped. A billing application may search a CAM to increment a traffic counter to so that a user may be billed according to bandwidth use.

SUMMARY

According to one aspect, a method may include counting the number of times each of a group of entries in a CAM matches one or more searches; grouping entries in the CAM into a first subset and a second subset based on the number of times each of the group of entries in the CAM matches one or more searches; and searching the first subset for a matching entry and, if no matching entry is found, searching the second subset for the matching entry.

According to another aspect, a network device may include a memory for storing groups of network addresses, where a first group includes network addresses determined more likely to be searched than a second group of network addresses; an input/output unit to receive a data unit including one of a destination network address or source network address; and a processor to search the first group of network addresses for the one of the destination network address or the source network address and, if a match is not found, to search the second group of network addresses for the one of the destination network address or the source network address.

According to another aspect, a method may include grouping network addresses stored in a memory into groups based on a likelihood of receiving data units corresponding to each of the network addresses; receiving a data unit; extracting a network address from the received data unit; and searching one of the groups most likely to include the extracted network address for the extracted network addresses and, if a matching entry is not found, searching a next one of the groups for the extracted network address.

According to another aspect, an apparatus may include means for counting a number of times each of a group of entries in a CAM matches one or more searches; means for grouping entries in the CAM into a first subset and a second subset based on the number of times each of the group of entries in the CAM matches one or more searches; and means for searching the first subset for a matching entry and, if no matching entry is found, searching the second subset for the matching entry.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate one or more embodiments described herein and, together with the description, explain these embodiments. In the drawings,

FIG. 1 is a block diagram of an exemplary environment in which embodiments may be implemented;

FIG. 2 is a block diagram of exemplary components of a network device of FIG. 1;

FIG. 3 is a block diagram of exemplary components of a line card of FIG. 2;

FIG. 4 is a block diagram of exemplary components of an input/output unit of FIG. 3;

FIGS. 5A and 5B are a diagrams of an exemplary address table and an exemplary count table of FIG. 4, respectively;

FIG. 6 is a flowchart of an exemplary process for analyzing network traffic;

FIGS. 7A and 7B are diagrams of an exemplary address table and an exemplary count table, respectively;

FIG. 8 is a flowchart of an exemplary process for organizing an address table; and

FIGS. 9A and 9B are diagrams of an exemplary address table and an exemplary count table, respectively.

DETAILED DESCRIPTION

The following detailed description refers to the accompanying drawings. The same reference numbers in different drawings may identify the same or similar elements. Also, the following detailed description does not limit the invention. Instead, the scope of the invention is defined by the appended claims and equivalents.

Although searching a CAM may be fast, it often requires a large amount of power, e.g., the amount of work done or energy transferred per unit of time. The amount of power required to search a CAM may be proportional to the number of entries in the CAM. It may be the case, however, that the same CAM entries are searched for time and time again. In one embodiment, CAM entries more likely to be searched may be grouped together. If an initial search of the group is successful, power may be saved because the entire CAM was not unnecessarily searched. If the search was not successful, the remaining CAM entries (or another group of entries) of the CAM may be searched. As a result, the average power consumed by the CAM over a period of time may be reduced. Counting how often some entries in the CAM are searched for may determine which entries are more likely to be searched and, subsequently, grouped together.

Exemplary Environment

FIG. 1 is a block diagram of an exemplary environment 100 in which embodiments described herein may be implemented. Environment 100 may include nodes 102-1 through 102-4 (collectively “nodes 102,” individually “node 102-x”), a network device 110 to receive and forward data, and links 112-1 through 112-4 (collectively “links 112,” individually “link 112-x”) coupling nodes 102 to network device 110. In practice, there may be more, different, or fewer devices or a different arrangement of devices than what is shown in FIG. 1. For example, environment 100 may include thousands or even millions of nodes and/or network devices. Further, while FIG. 1 shows nodes 102 and network device 110 in environment 100, one or more of these devices may be remotely located from each other, e.g., the devices may be geographically diverse. Although arrows in FIG. 1 may indicate communication directly between devices, it should be understood that communication may be indirect through one or more networks or network devices.

Network device 110 may communicate with nodes 102-1 through 102-4 over links 112-1 through 112-4, respectively. Network device 110 may receive data from one node and may forward the data to one or more other nodes. For example, network device 110 may receive a packet from node 102-1 and may forward the packet to node 102-2. For a multicast, network device 110 may receive a packet from node 102-1 and may forward the packet to nodes 102-2, 102-3, and 102-4. Network device 110 may be a router, a switch, a packet forwarding engine, a firewall, or any other network device capable of receiving and forwarding packets. Network device 110 may also be considered a “node.” Communication among user device 110 and nodes 102 may be accomplished via wired and/or wireless communication connections.

Nodes 102 may include computers, telephones, personal digital assistants, or any other communication devices that may transmit or receive data. Nodes 102 may include, for example, computers that exchange data through network device 110. Nodes 102 may also include, for example, telephones that exchange voice conversations through network device 110.

Network Device

FIG. 2 is a block diagram of exemplary components of network device 110. Network device 110 may include packet forwarding engines 202-1 through 202-4 (collectively “PFEs 202,” individually “PFE 202-x”), line cards 252-1 through 252-4 (collectively “line cards 252,” individually “line card 252-x”), a switch fabric 204, and a control device 206. Network device 110 may include other or different components (not shown) that aid in receiving, transmitting, and/or processing data. For example, there may be more than or less than four PFEs 202 and/or more or less than four line cards 252. Moreover, other configurations of components in network device 110 are possible. Although components of network device 110 are shown together, one or more components of network device may be remotely located from each other.

Control device 206 may perform high level management functions for network device 110. For example, control device 206 may communicate with other network devices (not shown) coupled to network device 110 to exchange information regarding network topology. Control device 206 may create routing tables based on network topology information, create forwarding tables based on the routing tables, and forward the forwarding tables to PFEs 202. Control device 206 may also perform other general control and monitoring functions for network device 110.

Line cards 252 may process incoming data units from links 112. A data unit may include all or a portion of a data packet. Line cards 252 may reassemble data units to form packets and may pass the packets to PFEs 202. Data received by line cards 252 from links 112 may be formatted according to one of several protocols, such as the synchronous optical network (SONET) standard, an asynchronous transfer mode (ATM) technology, or the Ethernet standard. Likewise, line cards 252 may be coupled to nodes 102 via many types of transport media, such as optical fiber, coaxial cable, twisted pair, etc. Line cards 252 may receive packets from PFEs 202 for transmission on links 112. Line cards 252 may prepare packets for transmission by, for example, segmenting packets into data units, adding headers, and transmitting the data units on links 112.

PFEs 202 may each connect to switch fabric 204 (as indicated by dashed lines in FIG. 2) and control device 206. PFEs 202 may receive packets from line cards 252. PFE 202-x may perform a route lookup for a packet using a forwarding table to determine destination information. If the destination information indicates that the packet should be sent out on line card 252-x attached to PFE 202-x, PFE 202-x may pass the packet to the attached line card 252-x. If the destination information indicates that the packet should be sent out on line card 252-x not attached to PFE 202-x, then PFE 202-x may transfer the packet to another PFE 202-x through switch fabric 204.

Line Cards

FIG. 3 is a block diagram illustrating exemplary components of line card 252-x. Line card 252-x may include a group of input/output (I/O) units 320-1 through 320-2 (collectively “I/O units 320,” individually “I/O unit 320-x”). Although FIG. 3 shows two I/O units 320, some embodiments may include one or more than two I/O units 320.

An I/O unit 320-x may operate as an interface between link 112-x and packet forwarding engine 202-x. I/O units 320 may be designed to handle different types of links 112. For example, I/O unit 320-x may interface with an Ethernet link. Alternatively, I/O unit 320-x may interface with an ATM link, a SONET link, etc.

FIG. 4 is an exemplary block diagram of exemplary components of I/O unit 320-x in one embodiment. I/O unit 320-x may include a bus 410, segmentation and reassembly (SAR) logic 420, a line card processor 430, and a memory 440. Bus 410 may permit communication among the components of I/O unit 320-x.

SAR logic 420 may segment packets into data units for transmission on links 112 and may reassemble packets from data units received on links 112. SAR logic 420 may include an egress portion 422 and an ingress portion 424. Egress portion 422 may segment packets into data units for transmission. Ingress portion 424 may receive data units for reassembly into packets. SAR logic 420 may include or be coupled to a transceiver-like mechanism (not shown) that enables I/O unit 320-x to communicate with other devices.

Line card processor 430 may include any type of processor or microprocessor that interprets and executes instructions. Line card processor 430 may include an application specific integrated circuit (ASIC), field programmable gate array (FPGA), or the like. Line card processor 430 may process packets prior to transferring the packets to PFE 202-x. Line card processor 430 may also process data units prior to transmission of the data units on link 212-x.

Memory 440 may include a random access memory (RAM) or another type of dynamic storage device that stores information and/or instructions for execution by line card processor. Memory 440 may include synchronous dynamic RAM (SDRAM). Memory 440 may include static RAM (SRAM) and/or dynamic RAM (DRAM). Memory 440 may include a read only memory (ROM) or another type of static storage device that stores static information and instructions for line card processor. Memory 440 may include a CAM or any other type of solid state memory. Memory 440 may include magnetic or optical recording medium and its corresponding drive for storing information and/or instructions. Line card processor 430 may include memory, including a portion of memory 440, such as a DRAM. Memory 440 may include an address table 442 and a count table 444, described in more detail below with respect to FIGS. 5A and 5B.

I/O unit 320-x may perform certain operations, as described in detail below. I/O unit 320-x may perform these operations in response to line card processor 4300 executing software instructions contained in a computer-readable medium, such as memory 440. A computer-readable medium may be defined as a physical or logical memory device and/or carrier wave. The software instructions may be read into memory 440 from another computer-readable medium or from another device. The software instructions contained in memory 440 may cause line card processor 430 to perform processes that are described below.

Address Table

FIG. 5A is a block diagram of an exemplary address table 442. Address table 442 may be stored in a memory 440 of I/O unit 320-x, for example. In the embodiment described below, address table 442 may be stored in a CAM. It should be noted, however, that address table 442 may be stored in any type of memory consistent with aspects described herein.

Address table 442 may include a network address field 502. Address table 442 may include additional, different, or fewer fields than illustrated in FIG. 5. Address field 502 may identify network addresses of nodes to or from which network device 110 may send or receive data. In exemplary address table 442, address field 502 lists Ethernet media access card (MAC) addresses. In other embodiments, network address field 502 may include addresses for other types of networks, such as an ATM or SONET network.

In one embodiment, exemplary address table 442 may include network addresses 01:AB, 02:AB, 03:AB, 04:AB, 05:AB, 06:AB, 07:AB, 08:AB, 09:AB, and 10:AB, stored in memory addresses A1, A2, B1, B2, B3, B4, B5, B6, B7, and B8, respectively. Although, network addresses 01:AB, 02:AB, etc., may not be valid Ethernet MAC addresses, these addresses may be used for exemplary purposes. Additionally, although memory addresses A1, A2, and B1 through B8 may not be typical memory addresses, they may be used for exemplary purposes as memory addresses in a CAM, for example.

Memory addresses and their corresponding network addresses may be grouped into subsets. As shown in FIG. 5A, a first subset (e.g., group) may include memory addresses A1 and A2. A second subset may include memory addresses B1 through B8. Although address table 442 shows two subsets for exemplary purposes, address table 442 may be grouped into more than two subsets. Further, although address table 442 shows two physically distinct subsets, subsets may be physically intertwined. In other words, subsets need not be contiguous. In addition, subsets may be of an arbitrary size and may be distributed across multiple memories, e.g., multiple CAMs.

Address table 442 may be searched for network addresses. For example, a search of the network address 01:AB may return the address, if any, where that network address is stored, e.g., A1. A search of the network address 02:AB would return the address A2, etc. Address table 442 may be searched for MAC address filtering (permitting or denying certain MAC address), MAC address accounting (counting the quantity of traffic to or from a MAC address), etc. In one embodiment, address table 442 may be searched to convert two VLAN identifiers into an interface ID.

Subsets of address table 442 may be searched. In one embodiment, the first subset may be searched for an address and, if the address is not found in the first subset, the next, e.g., second, subset may be searched. For example, address table 442 may be searched for address 04:AB. In this example, the first subset may be searched and may return no memory address, e.g., address 04:AB may not be found in the first subset. The second subset may be searched, which may result in the memory address B2 being returned because address 04:AB may be stored at memory location B2.

Searching the first subset (e.g., memory address A1 and A2) may require less power than searching the second subset (e.g., memory addresses B1 through B8) because the first subset has fewer memory locations than the second subset. Likewise, searching the first subset for an address may require less power than searching the entire address table 442. Further, searching the second subset for an address may require less power than searching the entire address table 442. In one embodiment, the network addresses more likely to be searched may be stored in the first subset; while network addresses less likely to be searched than those in the first subset may be stored in the second subset. When searching address table 442 for an address, it may only be necessary to search the first subset. If a match is not found in the first subset, then the second subset may be searched. Because the network addresses that are searched for the most often are in the first subset, total power consumption may be reduced as compared to searching the entire memory. In one embodiment, the average power consumed over time may be reduced. In one embodiment, the average amount of time to find a matching entry in the CAM may be increased since a search has to be performed more than once.

FIG. 5B is a block diagram of an exemplary count table 444. Count table 444 may be stored in memory 440 of I/O unit 320-x, for example. In one embodiment described below, count table 444 may be stored in an SDRAM associated with memory 440. Count table 444 may be stored in an SRAM and/or a DRAM. For example, count table 444 may be stored in a DRAM included in line card processor 430 and stored in an SRAM included in memory 440 on I/O unit 320-x. Count table 444 may be stored in any type of memory, however, including the same memory as address table 442.

Count table 444 may include a CAM address field 504 and a count field 506. CAM address field 504 may identify a memory address in address table 502. Count field 506 may include a count of the number of packets or data units passed to or from the MAC address stored in the memory address identified in the corresponding CAM address field 504. For example, the MAC address 01:AB (stored in address table 442 at memory address A1) has had 95 packets sent to or from that address. That is, the network address stored at CAM address A1 has a count value of 95. Count table 444 may include additional, different, or fewer fields than illustrated in FIG. 5.

As shown in the exemplary count table 444, the network address stored at CAM address A2 has a count value of 93; the network address stored at CAM address B1 has a count value of 83; the network address stored at CAM address B2 has a count value of 92; the network address stored at CAM address B3 has a count value of 10; the network address stored at CAM address B4 has a count value of 29; the network address stored at CAM address B5 has a count value of 23; the network address stored at CAM address B6 has a count value of 30; the network address stored at CAM address B7 has a count value of 65; and the network address stored at CAM address B8 has a count value of 11.

When a packet is sent to or received from a network address in network address field 502, the corresponding counter in count table 444 may be incremented. For example, if a packet (or other data unit) is received for the address 04:AB (the network address stored at memory address B2), the corresponding count may be incremented from 92 to 93. If another packet is received for the network address 04:AB, the corresponding count may be incremented again from 93 to 94.

In one embodiment, address table 442 may store the most frequently searched network addresses in a subset of address table 442. For example, network addresses 01:AB and 02:AB may be the most frequently searched network addresses and, as a result, may be stored in the first subset with memory addresses A1 and A2. In one embodiment, subsets may be dynamically generated or modified in response to the values maintained in count field 506.

Exemplary Processing

FIG. 6 is a flowchart of a process 600 for analyzing network traffic. Process 600 is described below with respect to address table 442 and count table 444. In one embodiment, process 600 may be performed by line card processor 430.

Process 600 may begin when a data unit is received (block 602). A data unit may be a frame, a cell, a packet, etc. A data unit may be received in network device 110, for example, in either egress portion 422 or ingress portion 424. A network address, e.g., MAC address, may be extracted from the data unit (block 604). The extracted address may be a source network address or a destination network address. In one example, network device 110 may be configured to monitor the quantity of data being passed to a node 102-x in a network. In this example, a destination address may be extracted in ingress portion 424. If network device 110 is configured to monitor the quantity of data being passed from a node 102-x from a network, a source address may be extracted in egress portion 422.

The first subset of network address table 442, such as the subset with CAM memory addresses A1 and A2, may be searched for the extracted network address (block 606). In one embodiment, the first subset may be the subset determined to have the highest probability of finding a match. If the extracted network address is found in the first subset (block 608: YES), the value in count table 444 corresponding to the extracted network address may be incremented (block 614). In other words, the value in count table 444 corresponding to the CAM memory address storing the extracted network address may be incremented. If the extracted network address is not found in the first subset (block 608: NO), then the next subset of address table 442, e.g., the second subset including addresses B1 through B8, may be searched for the extracted network address (block 610). The next subset may be the subset with the next highest probability of finding a match. If the extracted network address is not found, then process 600 may return to block 610 and the next subset of address table 442 may be searched. Although exemplary network address table 442 only includes two subsets, other embodiments may include more than two subsets. If the extracted network address is found (block 612: YES), the value in count table 444 corresponding to the extracted network address may be incremented (block 614). The data unit may be forwarded to its destination based, for example, on a result of the search in block 606.

An example of process 600 is described below with respect to FIGS. 5A, 5B, 7A and 7B. FIG. 7A is a diagram of an exemplary address table 442 and FIG. 7B is a diagram of an exemplary count table 444. In this example, network device 110 may receive two (2) data units destined for a node with a network address of 04:AB. As shown in FIGS. 5A and 7A, the network address of 04:AB may be stored in address table 442 at memory address B2. As described in more detail below, the value in count field 506 of count table 444 corresponding to memory address B2 may, therefore, be incremented by two (2) as shown in FIG. 7B (“94”) as compared to the value FIG. 5B (“92”).

More specifically, the first data unit in this example may enter ingress portion 424. The destination network address (04:AB) may be extracted. The first subset of address table 442 may be searched for the extracted network address (04:AB). In this example, the extracted address may not be found in the first subset of address table 442. The second subset of address table 442 may be searched for the extracted network address (04:AB). In this example, the extracted address may be found at CAM memory address B2. The value in count table 444 corresponding to CAM memory address B2 may be incremented by one. In this case, “92” appearing in count table 444 corresponding to CAM address may be increased to “93” (not shown).

The second data unit with address 04:AB may enter ingress portion 424. The destination network address (04:AB) may be extracted. The first subset of address table 442 may be searched for the extracted network address (04:AB). In this example, the extracted address may not be found in the first subset of address table 442. The second subset of address table 442 may be searched for the extracted network address (04:AB). In this example, the extracted address may be found at CAM address B2. The value in count table 444 corresponding to CAM memory address B2 may be incremented. In this case, “93” (incremented when the first data unit was received) in count table 444 corresponding to CAM address may be increased to “94” as shown circled in FIG. 7B.

FIG. 8 is a flow diagram of an exemplary process 800 for determining the network addresses in address table 442 most likely to be searched. Process 800 may execute a periodic basis, such as every second, every minute, every hour, etc. Process 800 is described below with respect to FIGS. 7A, 7B, 9A, and 9B. FIG. 7A is a diagram of an exemplary address table 442 and FIG. 7B is a diagram of an exemplary count table 444, both before execution of exemplary process 800. FIG. 9A is a diagram of an exemplary address table 442 and FIG. 9B is a diagram of an exemplary count table 444, both after execution of exemplary process 800.

The CAM memory addresses in count table 444 with the highest count may be found (block 802). In one embodiment, if the first subset includes two addresses, e.g., network or CAM addresses, then the two highest count values may be determined. For example, as shown in FIG. 7B, the two highest count values are 94 and 95 corresponding to CAM address B2 and A2, respectively. CAM addresses B2 and A2 correspond to MAC addresses 04:AB and 01:AB, respectively.

The network addresses, e.g., MAC address, in address table 442 corresponding to the highest count values may be moved to the first subset (block 804), if necessary. For example, referring to FIG. 7A and FIG. 9A, network address 04:AB may be moved to CAM address A2 in the first subset from the second subset address B2. MAC address 02:AB may be moved from CAM address A2 in the first subset to CAM address B2 in the second subset to make room for network address 04:AB. Network address 01:AB already may be in the first subset and, therefore, may not have to be moved to the first subset. In one embodiment, subset designations may be switched rather than moving memory content.

The count values in count table 444 may also be moved with respect to the corresponding network address in address table 442 (block 806). For example, referring to FIGS. 7 and 8, the count value of 94 is moved to correspond to CAM address A2 and the count value of 93 is moved to correspond to CAM address B2.

Because the example in FIGS. 7A, 7B, 9A, and 9B has two subsets, process 800 may stop. In embodiments with more than two subsets, however, process 800 may continue. The address in count table with the next highest count may be found (block 808). In one embodiment, if the next subset includes eight addresses, then the eight next highest count values may be determined. The address in address table 442 with the next highest count may be moved to the next subset (block 810). The addresses in count table 444 corresponding to the address in address table 442 may be moved accordingly (block 812).

Process 800 may be considered a sorting algorithm. Other types of sorting algorithms may be used where the most frequent addresses are stored in the first subset, the second most frequent addresses are stored in the second subset, the third most frequent addresses are stored in the third subset, etc. Process 800 may be a sorting algorithm performed by a processor, such as line card processor 430, executing software instructions. The processor may store count table 444 in a memory included within the processor, such as a DRAM. Count table 444 may also be stored in a memory, such as a DRAM, external to the processor. The processor may copy the contents of count table 444 stored internally to or from the count table 444 stored externally as necessary.

Other processes may determine the network addresses in address table 442 most likely to be searched. For example, data units may be inspected for protocol type. A weighted average of the counter value may be used to determine the network addresses in address table 442 most likely to be searched. In another implementation consistent with aspects described herein, past history of traffic may be used to determine the network addresses in address table 442 most likely to be searched. In one embodiment, a time-dependant function of past history of count values may be may be used to determine the network addresses in address table 442 most likely to be searched. For example, past count values may “decay” with time so older count values are not as important as newer count values. For instance, a new count value may equal 0.9* a past count value plus a current count value. In addition, the user configuration may be used to determine the network addresses in address table 442 most likely to be searched. For example, a network address configured to benefit from a higher bandwidth (as purchased by a customer) may be more likely to be searched.

In the above example, if 90% of the searches are satisfied by searching the first subset and 10% of the searches are satisfied by searching the second subset, power consumption may be reduced by 72% because, on average, only 2.8 CAM entries would have to be searched (0.9*2+0.1*10) as opposed to searching all 10. Because two searches may be performed, the total search time may increase by 10% ((0.9*1+0.1*2−1=0.1).

Although embodiments described above include network device 110, other embodiments may include a CAM in a device other than network devices. In addition, although embodiments described above may include a CAM, other embodiments may include memory devices other than CAMs.

CONCLUSION

Implementations described herein may allow a network device to conserve power, e.g., the amount of work done or energy transferred per unit of time. By grouping entries in a CAM, the average power consumed by the CAM over a period of time may be reduced.

The descriptions of exemplary components above include a discussion of software instructions contained in computer-readable media. Alternatively, in each of these implementations, hardwired circuitry may be used in place of or in combination with software instructions to implement processes described herein. Thus, implementations described herein are not limited to any specific combination of hardware circuitry and software.

It will also be apparent that aspects, as described above, may be implemented in many different forms of software, firmware, and hardware in the implementations illustrated in the figures. The actual software code or specialized control hardware used to implement these aspects is not limiting of the present invention. Thus, the operation and behavior of the aspects were described without reference to the specific software code—it being understood that software or control hardware could be designed to implement the aspects based on the description herein.

Further, although the processes described above, including process 600 and 800, may indicate a certain order of blocks, the blocks in these figures may be configured in any order.

In addition, implementations described herein may use the internet-protocol (IP), asynchronous transfer mode (ATM) protocol, or any other type of network protocol. As such, implementations described herein may use IP addresses, ATM addresses, or any other type of network addresses. Implementations may be described in terms of packets, implementations could use any form of data (packet or non-packet).

Even though particular combinations of features are recited in the claims and/or disclosed in the specification, these combinations are not intended to limit the invention. In fact, many of these features may be combined in ways not specifically recited in the claims and/or disclosed in the specification.

No element, act, or instruction used in the present application should be construed as critical or essential to the invention unless explicitly described as such. Also, as used herein, the article “a” is intended to include one or more items. Where only one item is intended, the term “one” or similar language is used. Further, the phrase “based on” is intended to mean “based, at least in part, on” unless explicitly stated otherwise. 

1-7. (canceled)
 8. A network device comprising: a memory for storing a plurality of groups of network addresses, where a first group includes network addresses determined more likely to be searched than a second group of network addresses; an input/output unit to receive a data unit including one of a destination network address or source network address; and a processor to search the first group of network addresses for the one of the destination network address or the source network address and, if a match is not found, to search the second group of network addresses for the one of the destination network address or the source network address.
 9. The device of claim 8, where the memory includes a content addressable memory (CAM).
 10. The device of claim 9, where the memory includes values indicative of a number of times the memory has been searched for one of the destination or source network address.
 11. The device of claim 10, where the processor increments a counter indicating the number of times the memory was searched for the destination or source network address.
 12. The device of claim 11, where the processor regroups the plurality of groups of network addresses based on the incremented counter or a weighted average including the incremented counter.
 13. The device of claim 10, where the processor determines the network addresses more likely to be searched based on the values indicative of the number of times the memory was searched for the destination or source network address.
 14. The device of claim 10, wherein the processor determines whether to forward the data unit or drop the data unit based on one of the search of the first group or the search of the second group.
 15. The device of claim 10, wherein the processor groups the entries in the CAM based on a time-dependent function of the number of times each of the plurality of entries in the CAM matches the one or more searches.
 16. A method comprising: grouping network addresses stored in a memory into a plurality of groups based on a likelihood of receiving data units corresponding to each of the network addresses; receiving a data unit; extracting a network address from the received data unit; and searching one of the plurality of groups most likely to include the extracted network address for the extracted network addresses and, if a matching entry is not found, searching a next one of the plurality of groups for the extracted network address.
 17. The method of claim 16, where the memory is a content addressable memory (CAM) and where grouping the network address stored in the memory includes grouping the network address stored in the CAM.
 18. The method of claim 17, further including incrementing a counter indicative of a number of times the CAM was searched for the extracted address.
 19. (canceled)
 20. (canceled) 